Recovering Fields from Their Decomposition Graphs
نویسنده
چکیده
Recall that the birational anabelian conjecture originating in ideas presented in Grothendieck’s Esquisse d’un Programme [G1] and Letter to Faltings [G2], asserts roughly the following: First, there should exist a group theoretical recipe by which one can recognize the absolute Galois groups GK of finitely generated infinite fields K among all the profinite groups. Second, if G = GK is such an absolute Galois group, then the group theoretical recipe recovers the field K from GK in a functorial way. Third, the recipe should be invariant under open homomorphisms of absolute Galois groups. In particular, the category of finitely generated infinite fields (up to Frobenius twist) should be equivalent to the category of their absolute Galois groups and open outer homomorphisms between these groups. A first instance of this situation is the celebrated Neukirch–Uchida Theorem, which says that global fields are characterized by their absolute Galois groups. I will not go into further details about the results concerning Grothendieck’s (birational) anabelian geometry, but the interested reader can find more about this in Szamuely’s Bourbaki Séminaire talk [Sz], and Faltings’ Séminare Bourbaki talk [Fa], and newer results by Stix [St], Mochizuki [Mz], Saidi–Tamagawa [S–T], and Koenigsmann [Ko], Minhyong Kim [Ki] concerning the (birational) section conjecture. The idea behind Grothendieck’s anabelian geometry is that the arithmetical Galois action on rich geometric fundamental groups (like the geometric absolute Galois group) makes objects very rigid, so that there is no room left for non-geometric morphisms between such rich fundamental groups endowed with arithmetical Galois action. On the other hand, Bogomolov [Bo] advanced at the beginning of the 1990’s the idea that one should have anabelian type results in a total absence of an arithmetical action as follows: Let ` be a fixed rational prime number. Consider function fieldsK|k over algebraically closed fields k of characteristic 6= `. For each such a function field K|k, let G ′′ K := Gal(K ′′|K) be the Galois group of a maximal pro-` abelian-by-central Galois extension K ′′|K. Note that if G := [G, GK ](G ) ∞ , where i ≥ 0 and G = GK , are the central `∞ terms of the absolute Galois group GK of K, then we have G ′′ K = G /G. Further, G ′ K = G /G is the Galois group of the maximal pro-` abelian sub-extension K ′|K of K ′′|K; and denoting by G(∞) the intersection of all the G, it follows that GK(`) := GK/G (∞) is the maximal pro-` quotient of GK . Now the program initiated by Bogomolov in loc.cit. has as ultimate goal to recover function fieldsK|k with tr. deg(K|k) > 1 as above from G ′′ K in a functorial way. (Note
منابع مشابه
The spectrum of Platonic graphs over finite fields
We give a decomposition theorem for Platonic graphs over finite fields and use this to determine the spectrum of these graphs. We also derive estimates for the isoperimetric numbers of the graphs. THE SPECTRUM OF PLATONIC GRAPHS OVER FINITE FIELDS MICHELLE DEDEO, DOMINIC LANPHIER, AND MARVIN MINEI Abstract. We give a decomposition theorem for Platonic graphs over finite fields and use this to d...
متن کاملDistinct edge geodetic decomposition in graphs
Let G=(V,E) be a simple connected graph of order p and size q. A decomposition of a graph G is a collection π of edge-disjoint subgraphs G_1,G_2,…,G_n of G such that every edge of G belongs to exactly one G_i,(1≤i ≤n). The decomposition 〖π={G〗_1,G_2,…,G_n} of a connected graph G is said to be a distinct edge geodetic decomposition if g_1 (G_i )≠g_1 (G_j ),(1≤i≠j≤n). The maximum cardinality of π...
متن کاملComputing Bond Types in Molecule Graphs
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this information is essential for various applications in chemistry, we consider the problem of recovering bond type information using a scoring function for the possible valences of each atom—the Bond Type Assignment problem. We...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کاملMixed cycle-E-super magic decomposition of complete bipartite graphs
An H-magic labeling in a H-decomposable graph G is a bijection f : V (G) ∪ E(G) → {1, 2, ..., p + q} such that for every copy H in the decomposition, ΣνεV(H) f(v) + ΣeεE(H) f(e) is constant. f is said to be H-E-super magic if f(E(G)) = {1, 2, · · · , q}. A family of subgraphs H1,H2, · · · ,Hh of G is a mixed cycle-decomposition of G if every subgraph Hi is isomorphic to some cycle Ck, for k ≥ ...
متن کاملLarge Scale Density-friendly Graph Decomposition via Convex Programming
Algorithms for finding dense regions in an input graph have proved to be effective tools in graph mining and data analysis. Recently, Tatti and Gionis [WWW 2015] presented a novel graph decomposition (known as the locally-dense decomposition) that is similar to the well-known k-core decomposition, with the additional property that its components are arranged in order of their densities. Such a ...
متن کامل